# 7-6 哥德巴赫猜想【函数】

def caixiang():
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num ** 0.5) + 1):
            if num % i == 0:
                return False
        return True

    def prime_sum_decomposition(num):
        if num % 2 != 0:
            print("Data error!")
            return

        for i in range(2, num // 2 + 1):
            if is_prime(i) and is_prime(num - i):
                print(f"{num} = {i} + {num - i}")
                break

    n = int(input())
    prime_sum_decomposition(n)
caixiang()